-
1 strongly connected graph
сильно связанный граф
—
[Л.Г.Суменко. Англо-русский словарь по информационным технологиям. М.: ГП ЦНИИС, 2003.]Тематики
EN
Англо-русский словарь нормативно-технической терминологии > strongly connected graph
-
2 strongly connected graph
stacked graph — "этажерочный" график
-
3 strongly connected graph
Большой англо-русский и русско-английский словарь > strongly connected graph
-
4 strongly connected graph
1) Математика: сильно связный граф2) Вычислительная техника: сильно связанный графУниверсальный англо-русский словарь > strongly connected graph
-
5 strongly connected graph
English-Russian dictionary of computer science and programming > strongly connected graph
-
6 strongly-connected graph
• силносвързан графEnglish-Bulgarian polytechnical dictionary > strongly-connected graph
-
7 strongly connected graph
English-Russian information technology > strongly connected graph
-
8 strongly connected
The English-Russian dictionary general scientific > strongly connected
-
9 strongly cyclic edge connected graph
Универсальный англо-русский словарь > strongly cyclic edge connected graph
-
10 strongly cyclic edge connected graph
English-Russian electronics dictionary > strongly cyclic edge connected graph
-
11 strongly cyclic edge connected graph
The New English-Russian Dictionary of Radio-electronics > strongly cyclic edge connected graph
-
12 strongly cyclic edge connected graph
English-Russian dictionary of electronics > strongly cyclic edge connected graph
-
13 graph
nounграф mbinding number of а graph число m связности графаcircumference of а graph окружность f графаgenus of а graph род m графаgraph coloring раскраска f графаgraph rewrite system система f переписи графовjoin of graphs соединение m графовlabelling of а graph разметка f графаniche graph граф-ниша fАнглийский-русский словарь по теории вероятностей, статистике и комбинаторике > graph
-
14 graph
1) график; диаграмма; кривая; номограмма2) граф3) лингв. вариант графемы•- acyclic graph
- alternating graph
- AND-OR graph
- bar graph - bipartite graph
- bunch graph
- Caley graph
- circuit-free graph
- circulant graph
- circular graph
- closed graph
- color graph
- complementary graph
- complete graph
- computation graph
- connected graph
- connectivity graph
- control flow graph
- data flow program graph
- data-flow graph - directed graph
- E-graph
- extremal graph
- finite graph
- flat graph
- flow graph
- game graph
- harward graph
- indirected graph
- infinite graph
- information graph
- irregular graph
- labeled graph
- line graph
- linear graph
- locally finite graph
- marked points graph
- monochromatic graph
- multidimensional graph
- N-chromatic graph
- network graph
- net graph
- node-symmetric graph
- object graph
- ordered graph
- oriented graph
- pattern graph
- planar graph
- processing graph
- product graph
- regular graph of degree N
- regular graph
- scene graph
- section graph
- signal-flow graph
- singular graph
- software graph
- spectral decision graph
- stacked bar graph
- stacked graph
- state graph
- strongly connected graph
- task graph
- total graph
- transaction graph
- transition graph
- tree graph
- two-dimensional graph
- undirected graph
- vertex-weighted graph
- weighted directed graph
- word graphEnglish-Russian dictionary of computer science and programming > graph
-
15 graph
1. n график, диаграмма, номограмма; криваяcomputation graph — вычислительный граф; граф вычислений
2. n мат. лингв. графgraph features — свойства графа; теоретико-графовые свойства
product graph — произведение графов; граф-произведение
singular graph — сингулярный граф; вырожденный граф
3. v изображать диаграммой; чертить графики4. v разг. размножать, копировать с помощью гектографаСинонимический ряд:1. chart (noun) bar chart; blueprint; chart; design; diagram; flow chart; linear representation; map; picture; pie chart; plot; table2. diagram (verb) diagram; draw; outline; trace -
16 connected
1. a связанный, соединённый2. a имеющий связи3. a связныйСинонимический ряд:1. coupled (adj.) adjoined; attached; combined; coupled; in tandem; joined; linked; merged; united2. joined in order (adj.) coherent; concatenated; consecutive; constant; contiguous; joined in order; undivided3. mutual (adj.) collective; common; joint; mutual; shared4. plugged in (adj.) hot; in circuit; live; plugged in; wired5. related (adj.) applicable; associated; interrelated; pertinent; related; relevant6. coupled (verb) affixed; attached; clipped; coupled; fastened; fixed; moored; secured7. joined (verb) affiliated; allied; associated; bound; bracketed; coalesced; combined; compounded; concreted; conjoined; conjugated; correlated; identified; joined; linked; married; melded; related; united; wedded; yoked -
17 connected
соединился; подключил; связанныйEnglish-Russian dictionary of Information technology > connected
-
18 graph
1. график2. диаграмма; графикcomputation graph — вычислительный граф; граф вычислений
3. чертить графикsingular graph — сингулярный граф; вырожденный граф
regular graph — однородный граф; регулярный граф
-
19 strongly
advсильноАнглийский-русский словарь по теории вероятностей, статистике и комбинаторике > strongly
-
20 graph
1. график, диаграммаcomputation graph — вычислительный граф; граф вычислений
2. графgraph features — свойства графа; теоретико-графовые свойства
product graph — произведение графов; граф-произведение
singular graph — сингулярный граф; вырожденный граф
3. гидрограф
- 1
- 2
См. также в других словарях:
Strongly connected component — Graph with strongly connected components marked A directed graph is called strongly connected if there is a path from each vertex in the graph to every other vertex. In particular, this means paths in each direction; a path from a to b and also a … Wikipedia
strongly connected component — noun Given a directed graph, a maximal strongly connected subgraph. See Also: connected component, partition … Wiktionary
strongly connected — adjective a) Of a directed graph, such that for every pair of vertices u and v there is a path from u to v and a path from v to u. b) Of a directed graph, such that for every pair of vertices u and v there is a directed path either from u to v or … Wiktionary
Tarjan's strongly connected components algorithm — Tarjan s Algorithm (named for its discoverer, Robert Tarjan) is a graph theory algorithm for finding the strongly connected components of a graph. It can be seen as an improved version of Kosaraju s algorithm, and is comparable in efficiency to… … Wikipedia
Graph (mathematics) — This article is about sets of vertices connected by edges. For graphs of mathematical functions, see Graph of a function. For statistical graphs, see Chart. Further information: Graph theory A drawing of a labeled graph on 6 vertices and 7 edges … Wikipedia
Connected component (graph theory) — A graph with three connected components. In graph theory, a connected component of an undirected graph is a subgraph in which any two vertices are connected to each other by paths, and which is connected to no additional vertices. For example,… … Wikipedia
Graph theory — In mathematics and computer science, graph theory is the study of graphs : mathematical structures used to model pairwise relations between objects from a certain collection. A graph in this context refers to a collection of vertices or nodes and … Wikipedia
Aperiodic graph — In the mathematical area of graph theory, a directed graph is said to be aperiodic if there is no integer k > 1 that divides the length of every cycle of the graph. Equivalently, a graph is aperiodic if the greatest common divisor of the lengths… … Wikipedia
Glossary of graph theory — Graph theory is a growing area in mathematical research, and has a large specialized vocabulary. Some authors use the same word with different meanings. Some authors use different words to mean the same thing. This page attempts to keep up with… … Wikipedia
Connectivity (graph theory) — In mathematics and computer science, connectivity is one of the basic concepts of graph theory: it asks for the minimum number of elements (nodes or edges) which need to be removed to disconnect the remaining nodes from each other[1]. It is… … Wikipedia
Claw-free graph — A claw In graph theory, an area of mathematics, a claw free graph is a graph that does not have a claw as an induced subgraph. A claw is another name for the complete bipartite graph K1,3 (that is, a star graph with three edges, three leaves, and … Wikipedia